The collapsibility of CAT(0) square $2$-complexes
نویسندگان
چکیده
منابع مشابه
The threshold for d-collapsibility in random complexes
In this paper we determine the threshold for d-collapsibility in the probabilistic model Xd(n, p) of d-dimensional simplicial complexes. A lower bound for this threshold p = ηd n was established in [?], and here we show that this is indeed the correct threshold. Namely, for every c > ηd, a complex drawn from Xd(n, c n ) is asymptotically almost surely not d-collapsible.
متن کاملCollapsibility and Vanishing of Top Homology in Random Simplicial Complexes
Let ∆n−1 denote the (n − 1)-dimensional simplex. Let Y be a random d-dimensional subcomplex of ∆n−1 obtained by starting with the full (d − 1)-dimensional skeleton of ∆n−1 and then adding each d-simplex independently with probability p = c n . We compute an explicit constant γd, with γ2 ' 2.45, γ3 ' 3.5 and γd = Θ(log d) as d → ∞, so that for c < γd such a random simplicial complex either colla...
متن کاملCOLLAPSIBILITY OF ( n)=Sn AND SOME RELATED CW COMPLEXES
Let ∆(Πn) denote the order complex of the partition lattice. The natural Sn-action on the set [n] induces an Sn-action on ∆(Πn). We show that the regular CW complex ∆(Πn)/Sn is collapsible. Even more, we show that ∆(Πn)/Sn is collapsible, where Π∆ is a suitable type selection of the partition lattice. This allows us to generalize and reprove in a conceptual way several previous results regardin...
متن کاملAutomata and Square Complexes.
We introduce a new geometric tool for analyzing groups of finite au-tomata. To each finite automaton we associate a square complex. The square complex is covered by a product of two trees iff the automaton is bi-reversible. Using this method we give examples of free groups and of Kazhdan groups which are generated by the different states of one finite (bi-reversible) automaton. We also reproduc...
متن کاملOn the Complexity of Recognition of 2-collapsibility
A simplicial complex is d-collapsible if it can be reduced to an empty simplex by repeatedly removing face of dimension less than d that it is contained in a unique maximal face. These complexes have been studied since every complex that is the nerve of a family of convex sets in R d is d-collapsible. We show that the question whether a given complex is 2-collapsible can be solved in polynomial...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Publicationes Mathematicae Debrecen
سال: 2020
ISSN: 0033-3883
DOI: 10.5486/pmd.2020.8619